Cellular-Automaton Decoders for Topological Quantum Memories
نویسندگان
چکیده
Decoders are one of the necessary building blocks for robust local quantum memories, basic primitives that must arguably be part of any functioning topological quantum computer. While surface codes have raised the prospects for scalability and performance of quantum storage devices, the task of decoding resorts to complicated classical algorithms. Such decoding algorithms are typically designed for traditional centralized computing architectures. This questions whether active decoding can be fast enough to outpace the decoherence time in systems with many qubits, giving rise to significant challenges. In this work, we address this question by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with nearest neighbors only, and repeatedly performing identical simple update rules. This framework for constructing topological quantum memories does not require any global operations or complex decoding algorithms. Furthermore, the local updates rules do not have to be perfect or synchronized, relaxing many of the former requirements on decoding devices. Hence, our work raises prospects for the technical feasibility of scalable and ultra-fast decoding devices. Through comprehensive numerical study (see Fig. 1c) we find that equipping error syndromes (anyons) with an attractive scalar field of the form 1/rα, can provide a working decoder with an error correction threshold and exponential error suppression. Considering the anyons to move according to the gradient of this field, we give an argument why error correction is possible only if α ≥ 1, i.e. the field is not too long ranged. A key insight is that in a discretized approximation of such fields can be generated via simple and local cellular automaton update rules in an efficient and robust manner. The field takes real values on a periodic D-dimensional square lattice ZL , with anyons constrained to a two-dimensional plane. At time t and location x ∈ ZL the field has a value φt(x), and at later times updates according to
منابع مشابه
Quantum Dot Cellular Automata Memories
In this paper we have discussed various memory architectures for Quantum Dot Cellular automata. New architectures have been proposed and their comparison has been done on the basis of area and latency. A protocol for using the serial memory has been outlined. A hybrid memory has been proposed. It is shown that the hybrid memory can be used as a tradeoff between area advantage of serial memory a...
متن کاملNovel Subtractor Design Based on Quantum-Dot Cellular Automata (QCA) Nanotechnology
Quantum-dot cellular automaton (QCA) is a novel nanotechnology with a very different computational method in compared with CMOS, whereas placement of electrons in cells indicates digital information. This nanotechnology with specifications such as fast speed, high parallel processing, small area, low power consumption and higher switching frequency becomes a promising candidate for CMOS tec...
متن کاملA Novel Design of a Multi-layer 2:4 Decoder using Quantum- Dot Cellular Automata
The quantum-dot cellular automata (QCA) is considered as an alternative tocomplementary metal oxide semiconductor (CMOS) technology based on physicalphenomena like Coulomb interaction to overcome the physical limitations of thistechnology. The decoder is one of the important components in digital circuits, whichcan be used in more comprehensive circuits such as full adde...
متن کاملQCA Design of Encoder for Low Power Memory Applications
A decoder is important component of memory, for address decoding and encoding. The size of Complementary Metal Oxide Semiconductor (CMOS) transistor keeps shrinking to increase the density on chip in accordance with Moore’s Law. The scaling affects the device performance due to constraints like heat dissipation and power consumption. A Quantum dot Cellular Automata (QCA) is an alternative to CM...
متن کاملDesign of sequential circuits by quantum-dot cellular automata
This paper proposes a detailed design analysis of sequential circuits for quantum-dot cellular automata (QCA). This analysis encompasses flip-flop (FF) devices as well as circuits. Initially, a novel RS-type FF amenable to a QCA implementation is proposed. This FF extends a previous threshold-based configuration to QCA by taking into account the timing issues associated with the adiabatic switc...
متن کامل